Bounds on the Capacity of the Discrete-Time Poisson Channel
نویسندگان
چکیده
The large-inputs asymptotic capacity of a peak and average power limited discrete-time Poisson channel is derived using a new firm (non-asymptotic) lower bound and an asymptotic upper bound. The upper bound is based on the dual expression for channel capacity and the recently introduced notion of capacityachieving input distributions that escape to infinity. The lower bound is based on a lemma that lower bounds the entropy of a conditionally Poisson random variable in terms of the differential entropy of the conditional mean.
منابع مشابه
Exact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملGaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملImproved Capacity Upper Bounds for the Discrete-Time Poisson Channel
We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the a...
متن کاملSpectral efficiency of optical direct detection
The spectral efficiency (channel capacity) of the optical direct-detection channel is studied. The modeling of the optical direct-detection channel as a discrete-time Poisson channel is reviewed. Closed-form integral representations for the entropy of random variables with Poisson and negative binomial distributions are derived. The spectral efficiency achievable with an arbitrary input gamma d...
متن کامل